The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

0 CpxTRS
↳1 RenamingProof (⇔, 0 ms)
↳2 CpxRelTRS
↳3 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)
↳4 typed CpxTrs
↳5 OrderProof (LOWER BOUND(ID), 0 ms)
↳6 typed CpxTrs
↳7 RewriteLemmaProof (LOWER BOUND(ID), 1094 ms)
↳8 BEST
    ↳9 typed CpxTrs
        ↳10 RewriteLemmaProof (LOWER BOUND(ID), 0 ms)
        ↳11 BEST
            ↳12 typed CpxTrs
                ↳13 LowerBoundsProof (⇔, 0 ms)
                ↳14 BOUNDS(n^1, INF)
            ↳15 typed CpxTrs
                ↳16 LowerBoundsProof (⇔, 0 ms)
                ↳17 BOUNDS(n^1, INF)
    ↳18 typed CpxTrs
        ↳19 LowerBoundsProof (⇔, 0 ms)
        ↳20 BOUNDS(n^1, INF)

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

O(0) → 0
+(0, x) → x
+(x, 0) → x
+(O(x), O(y)) → O(+(x, y))
+(O(x), I(y)) → I(+(x, y))
+(I(x), O(y)) → I(+(x, y))
+(I(x), I(y)) → O(+(+(x, y), I(0)))
*(0, x) → 0
*(x, 0) → 0
*(O(x), y) → O(*(x, y))
*(I(x), y) → +(O(*(x, y)), y)

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

Types:
O :: 0':I → 0':I
0' :: 0':I
+' :: 0':I → 0':I → 0':I
I :: 0':I → 0':I
*' :: 0':I → 0':I → 0':I
hole_0':I1_0 :: 0':I
gen_0':I2_0 :: Nat → 0':I

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
+', *'

They will be analysed ascendingly in the following order:
+' < *'

(6) Obligation:

TRS:
Rules:
O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

Types:
O :: 0':I → 0':I
0' :: 0':I
+' :: 0':I → 0':I → 0':I
I :: 0':I → 0':I
*' :: 0':I → 0':I → 0':I
hole_0':I1_0 :: 0':I
gen_0':I2_0 :: Nat → 0':I

Generator Equations:
gen_0':I2_0(0) ⇔ 0'
gen_0':I2_0(+(x, 1)) ⇔ I(gen_0':I2_0(x))

The following defined symbols remain to be analysed:
+', *'

They will be analysed ascendingly in the following order:
+' < *'

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Induction Base:
+'(gen_0':I2_0(0), gen_0':I2_0(0))

Induction Step:
+'(gen_0':I2_0(+(n4_0, 1)), gen_0':I2_0(+(n4_0, 1))) →RΩ(1)
O(+'(+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)), I(0'))) →IH
O(+'(*3_0, I(0')))

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

Types:
O :: 0':I → 0':I
0' :: 0':I
+' :: 0':I → 0':I → 0':I
I :: 0':I → 0':I
*' :: 0':I → 0':I → 0':I
hole_0':I1_0 :: 0':I
gen_0':I2_0 :: Nat → 0':I

Lemmas:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Generator Equations:
gen_0':I2_0(0) ⇔ 0'
gen_0':I2_0(+(x, 1)) ⇔ I(gen_0':I2_0(x))

The following defined symbols remain to be analysed:
*'

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
*'(gen_0':I2_0(n40533_0), gen_0':I2_0(0)) → gen_0':I2_0(0), rt ∈ Ω(1 + n405330)

Induction Base:
*'(gen_0':I2_0(0), gen_0':I2_0(0)) →RΩ(1)
0'

Induction Step:
*'(gen_0':I2_0(+(n40533_0, 1)), gen_0':I2_0(0)) →RΩ(1)
+'(O(*'(gen_0':I2_0(n40533_0), gen_0':I2_0(0))), gen_0':I2_0(0)) →IH
+'(O(gen_0':I2_0(0)), gen_0':I2_0(0)) →RΩ(1)
+'(0', gen_0':I2_0(0)) →RΩ(1)
gen_0':I2_0(0)

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

TRS:
Rules:
O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

Types:
O :: 0':I → 0':I
0' :: 0':I
+' :: 0':I → 0':I → 0':I
I :: 0':I → 0':I
*' :: 0':I → 0':I → 0':I
hole_0':I1_0 :: 0':I
gen_0':I2_0 :: Nat → 0':I

Lemmas:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)
*'(gen_0':I2_0(n40533_0), gen_0':I2_0(0)) → gen_0':I2_0(0), rt ∈ Ω(1 + n405330)

Generator Equations:
gen_0':I2_0(0) ⇔ 0'
gen_0':I2_0(+(x, 1)) ⇔ I(gen_0':I2_0(x))

No more defined symbols left to analyse.

(13) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

(14) BOUNDS(n^1, INF)

(15) Obligation:

TRS:
Rules:
O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

Types:
O :: 0':I → 0':I
0' :: 0':I
+' :: 0':I → 0':I → 0':I
I :: 0':I → 0':I
*' :: 0':I → 0':I → 0':I
hole_0':I1_0 :: 0':I
gen_0':I2_0 :: Nat → 0':I

Lemmas:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)
*'(gen_0':I2_0(n40533_0), gen_0':I2_0(0)) → gen_0':I2_0(0), rt ∈ Ω(1 + n405330)

Generator Equations:
gen_0':I2_0(0) ⇔ 0'
gen_0':I2_0(+(x, 1)) ⇔ I(gen_0':I2_0(x))

No more defined symbols left to analyse.

(16) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

(17) BOUNDS(n^1, INF)

(18) Obligation:

TRS:
Rules:
O(0') → 0'
+'(0', x) → x
+'(x, 0') → x
+'(O(x), O(y)) → O(+'(x, y))
+'(O(x), I(y)) → I(+'(x, y))
+'(I(x), O(y)) → I(+'(x, y))
+'(I(x), I(y)) → O(+'(+'(x, y), I(0')))
*'(0', x) → 0'
*'(x, 0') → 0'
*'(O(x), y) → O(*'(x, y))
*'(I(x), y) → +'(O(*'(x, y)), y)

Types:
O :: 0':I → 0':I
0' :: 0':I
+' :: 0':I → 0':I → 0':I
I :: 0':I → 0':I
*' :: 0':I → 0':I → 0':I
hole_0':I1_0 :: 0':I
gen_0':I2_0 :: Nat → 0':I

Lemmas:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

Generator Equations:
gen_0':I2_0(0) ⇔ 0'
gen_0':I2_0(+(x, 1)) ⇔ I(gen_0':I2_0(x))

No more defined symbols left to analyse.

(19) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
+'(gen_0':I2_0(n4_0), gen_0':I2_0(n4_0)) → *3_0, rt ∈ Ω(n40)

(20) BOUNDS(n^1, INF)